منابع مشابه
Adaptive Linkage
Problem-speciic knowledge is often implemented in search algorithms using heuristics to determine which search paths are to be explored at any given instant. As in many other AI search methods, utilizing this knowledge will lead a genetic algorithm (GA) faster towards better results. In many problems, crucial knowledge is to be found not in individual components, but in interrelations between t...
متن کاملModeling crossover-induced linkage in genetic algorithms
The dynamics of a genetic algorithm undergoing ranking selection, mutation, and two-point crossover for the ones-counting problem is studied using a statistical mechanics approach. This approach has been used previously to study this problem, but with uniform crossover. Two-point crossover induces additional linkage between nearby loci which changes the dynamics significantly. To account for th...
متن کاملProbabilistic Adaptive Crossover (PAX): a Novel Genetic Algorithm Crossover Methodology
A new crossover technique for genetic algorithms is proposed in this paper. The technique is called probabilistic adaptive crossover and denoted by PAX. The method includes the estimation of the probability distribution of the population, in order to store in a unique probability vector P information about the best and the worse solutions of the problem to be solved. The proposed methodology is...
متن کاملGpax: Genetic Parabolic Adaptive Crossover Operator
In this paper we propose a new crossover operator for real coded evolutionary algorithms that is based on a parabolic probability density function. This density function depends on two real parameters α and β which have the capacity to achieve exploration and exploitation dynamically during the evolutionary process in relation to the best individuals. In other words, the proposed crossover oper...
متن کاملAn Adaptive Crossover-Imaged Clustering Algorithm
The grid-based clustering algorithm is an efficient clustering algorithm, but its effect is seriously influenced by the size of the predefined grids and the threshold of the significant cells. The data space will be partitioned into a finite number of cells to form a grid structure and then performs all clustering operations on this obtained grid structure. To cluster efficiently and simultaneo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2000
ISSN: 1063-6560,1530-9304
DOI: 10.1162/106365600750078817